Kinematic self-similarity
نویسندگان
چکیده
منابع مشابه
1 Kinematic Self-similarity
Self-similarity in general relativity is briefly reviewed and the differences between self-similarity of the first kind (which can be obtained from dimensional considerations and is invariantly characterized by the existence of a homothetic vector in perfect fluid spacetimes) and generalized self-similarity are discussed. The covariant notion of a kinematic self-similarity in the context of rel...
متن کاملSelf-similarity of trailing vortices Self-similarity of trailing vortices
Trailing vortices have been repeatedly shown to exhibit a remarkably robust selfsimilarity independent of the Reynolds number and upstream boundary conditions. The collapse of the inner-scaled circulation profiles of a trailing vortex has even been previously demonstrated for the cases of highly unsteady and turbulent vortex systems, as well as for vortices which were incompletely developed. A ...
متن کاملSelf-similarity networks and self-similarity network group
The self-similarity of complex has extensive practical background in real world. It is similar to the phenomena of social relationships: “things of one kind come together, birds of a feather flock together”. Hence, we proposed the self-similarity network evolving model based on attributes similarity between the nodes. In network each node has the attribute value, by this computing similarity be...
متن کاملHuman action recognition based on kinematic similarity in real time
Human action recognition using 3D pose data has gained a growing interest in the field of computer robotic interfaces and pattern recognition since the availability of hardware to capture human pose. In this paper, we propose a fast, simple, and powerful method of human action recognition based on human kinematic similarity. The key to this method is that the action descriptor consists of joint...
متن کاملSelf-Similarity of Graphs
An old problem raised independently by Jacobson and Schönheim asks to determine the maximum s for which every graph with m edges contains a pair of edge-disjoint isomorphic subgraphs with s edges. In this paper we determine this maximum up to a constant factor. We show that every m-edge graph contains a pair of edge-disjoint isomorphic subgraphs with at least c(m logm) edges for some absolute c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Classical and Quantum Gravity
سال: 1997
ISSN: 0264-9381,1361-6382
DOI: 10.1088/0264-9381/14/1/012